Recursive Generation of 5-Regular Planar Graphs
نویسندگان
چکیده
We describe for the first time how the 5-regular simple planar graphs can all be obtained from a simple family of starting graphs by repeatedly applying a few expansion operations. The proof uses an innovative amalgam of theory and computation. By incorporating the recursion into the canonical construction path method of isomorph rejection, a generator of non-isomorphic 5-regular planar graphs is obtained with time complexity O(n2) per isomorphism class.
منابع مشابه
Recursive generation of simple planar 5-regular graphs and pentangulations
We describe how the 5-regular simple planar graphs can all be obtained from an elementary family of starting graphs by repeatedly applying a few local expansion operations. The proof uses an amalgam of theory and computation. By incorporating the recursion into the canonical construction path method of isomorph rejection, a generator of non-isomorphic embedded 5-regular planar graphs is obtaine...
متن کاملEnumeration of labeled 4-regular planar graphs
In this extended abstract, we present the first combinatorial scheme for counting labeled 4-regular planar graphs through a complete recursive decomposition. More precisely, we show that the exponential generating function counting labeled 4regular planar graphs can be computed effectively as the solution of a system of equations. From here we can extract the coefficients by means of algebraic ...
متن کاملPohl-Warnsdorf – Revisited
Two new series of graphs are introduced. Properties of these graphs make them suitable as test beds for Hamiltonian path heuristics. The graphs are planar and regular of degree 3, and each series has a simple recursive definition. These graphs are “conceptual adversaries” to methods that try to exploit local characteristics. For each series, we give an analysis showing that the number of Hamilt...
متن کاملApproximate Counting via Correlation Decay on Planar Graphs
We show for a broad class of counting problems, correlation decay (strong spatial mixing) implies FPTAS on planar graphs. The framework for the counting problems considered by us is the Holant problems with arbitrary constant-size domain and symmetric constraint functions. We define a notion of regularity on the constraint functions, which covers a wide range of natural and important counting p...
متن کاملFinding Regular Subgraphs in Both Arbitrary and Planar Graphs
We show that the problems of deciding whether an arbitrary graph has a k-regular subgraph, for some given k 3; of deciding whether a planar graph has a quartic subgraph; and of deciding whether a planar graph has a quintic subgraph, are complete for NP via logspace reductions. There are no regular planar graphs of degree greater than 5.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009